Divisors

Memory limit: 64 MB

In this problem we are interested in the divisors of a given natural number . Let us denote the set of all these divisors by . We are given an expression which consists of constant numbers from the set , variables which can assume any values from the set and binary functions computing the greatest common divisor and the least common multiple.

For a given expression we would like to find out whether its value is constant regardless of the values of all variables.

Input

The first line of the standard input contains one integer () denoting the number of test cases. Each of the following lines contains a description of a single test case. Each such description starts with an integer (). It is followed by a description of the expression. An expression is a constant, a variable or a function.

Each number in the description represents a constant. All these numbers are positive divisors of .

Variables are represented as sequences of at most 5 lowercase letters of the English alphabet. Variables represented by the same sequences of letters are considered the same.

The sequences of letters NWD and NWW represent the functions computing the greatest common divisor and the least common multiple, respectively. The name of a function is followed by a single space, followed by space-separated descriptions of its arguments, which are expressions (hence, the description of the expression is recursive).

You may assume that the total size of the input file does not exceed 2 MB.

Output

Your program should output lines to the standard output containing the answers to subsequent test cases. The answer to a single test case is one word: TAK (meaning yes in Polish) or NIE (meaning no in Polish) stating whether the expression in the test case represents a constant function.

Example

For the input data:

3
24 NWD 3 NWW x 12
15 NWD 15 nwd
10 10

the correct result is:

TAK
NIE
TAK

Task author: Dariusz Leniowski.